Strictness While Selection Articles

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Strictness

Strictness analysis (at least for at domains) is well understood. For a few years the main concern was eeciency, since the standard analysis was shown to be exponential in the worst case 9]. Thus lots of research evolved to nd eecient average-case algorithms. In Yale Haskell we have implemented a strictness analyzer that computes x-points via symbolic manipulation of boolean functions. This ext...

متن کامل

Strictness Meets Data Flow

Properties of programs can be formulated using various techniques: dataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness analysis (establishing when function parameters are evaluated in a lazy language) as a dataflow analysis by expressing the dataflow properties as an effect system. Strictness properties so expressed give a clearer opera...

متن کامل

On Strictness and Totality

Abs t rac t . In this paper we present a revised and extended version of the strictness and totality type assignment system introduced by Solberg, Nielson and Nielson in the Static Analysis Symposium '9~. Our main result is that (w.r.t. the possibility of replacing safely a lazy application by a strict one) the strictness and totality information given by this system is equivalent to the inform...

متن کامل

Operator Selection While Planning Under Uncertainty

This paper describes the best first search strategy used by U-Plan (Mansell 1993a), a planning system that constructs quantitatively ranked plans given an incomplete description of an uncertain environment. U-Plan uses uncertain and incomplete evidence describing the environment, characterises it using a Dempster­ Shafer interval, and generates a set of possible world states. Plan construction ...

متن کامل

Strictness and Totality Analysis

We definea novel inference system for strictness and totality analysis for the simplytyped lazy lambda-calculus with constants and fixpoints. Strictness information identifies those terms that definitely denote bottom (i.e. do not evaluate to WHNF) whereas totality information identifies those terms that definitely do not denote bottom (i.e. do evaluate to WHNF). The analysis is presented as an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Nepal Medical Association

سال: 2003

ISSN: 1815-672X,0028-2715

DOI: 10.31729/jnma.853